Comparison theorems on resistance distances and Kirchhoff indices of S, T-isomers
نویسندگان
چکیده
Comparison theorems on resistance distances and Kirchhoff indices of the so-called S& T -isomer graphs are established. Then these results are applied to compare Kirchhoff indices of hexagonal chains, showing that the straight chain is the unique chain with maximum Kirchhoff index, whereas the minimum Kirchhoff index is achieved only when the hexagonal chain is an ‘‘all-kink’’ chain. © 2014 Elsevier B.V. All rights reserved.
منابع مشابه
On the Kirchhoff and the Wiener Indices of Graphs and Block Decomposition
In this article we state a relation between the Kirchhoff and Wiener indices of a simple connected graph G and the Kirchhoff and Wiener indices of those subgraphs of G which are induced by its blocks. Then as an application, we define a composition of a rooted tree T and a graph G and calculate its Kirchhoff index in terms of parameters of T and G. Finally, we present an algorithm for computing...
متن کاملCacti with minimum, second-minimum, and third-minimum Kirchhoff indices
Resistance distance was introduced by Klein and Randić. The Kirchhoff index Kf(G) of a graph G is the sum of resistance distances between all pairs of vertices. A graph G is called a cactus if each block of G is either an edge or a cycle. Denote by Cat(n; t) the set of connected cacti possessing n vertices and t cycles. In this paper, we give the first three smallest Kirchhoff indices among gra...
متن کاملResistance distances and the Kirchhoff index in Cayley graphs
In most cases authors are permitted to post their version of the article (e.g. in Word or Tex form) to their personal website or institutional repository. Authors requiring further information regarding Elsevier's archiving and manuscript policies are encouraged to visit: a b s t r a c t In this paper, closed-form formulae for the Kirchhoff index and resistance distances of the Cayley graphs ov...
متن کاملOn relation between the Kirchhoff index and number of spanning trees of graph
Let $G=(V,E)$, $V={1,2,ldots,n}$, $E={e_1,e_2,ldots,e_m}$,be a simple connected graph, with sequence of vertex degrees$Delta =d_1geq d_2geqcdotsgeq d_n=delta >0$ and Laplacian eigenvalues$mu_1geq mu_2geqcdotsgeqmu_{n-1}>mu_n=0$. Denote by $Kf(G)=nsum_{i=1}^{n-1}frac{1}{mu_i}$ and $t=t(G)=frac 1n prod_{i=1}^{n-1} mu_i$ the Kirchhoff index and number of spanning tree...
متن کاملOn hyper-Kirchhoff index
The hyper-Kirchhoff index is introduced when the hyper-Wiener operator is applied to the resistance-distance matrix of a connected graph. We give lower and upper bounds for the hyper-Kirchhoff index, and determine the n-vertex unicyclic graphs with the smallest, the second and the third smallest as well as the largest, the second and the third largest hyper-Kirchhoff indices for n ≥ 5. We also ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete Applied Mathematics
دوره 175 شماره
صفحات -
تاریخ انتشار 2014